Grøstl - a SHA-3 candidate
نویسندگان
چکیده
Grøstl is a SHA-3 candidate proposal. Grøstl is an iterated hash function with a compression function built from two fixed, large, distinct permutations. The design of Grøstl is transparent and based on principles very different from those used in the SHA-family. The two permutations are constructed using the wide trail design strategy, which makes it possible to give strong statements about the resistance of Grøstl against large classes of cryptanalytic attacks. Moreover, if these permutations are assumed to be ideal, there is a proof for the security of the hash function. Grøstl is a byte-oriented SP-network which borrows components from the AES. The S-box used is identical to the one used in the block cipher AES and the diffusion layers are constructed in a similar manner to those of the AES. As a consequence there is a very strong confusion and diffusion in Grøstl. Grøstl is a so-called wide-pipe construction where the size of the internal state is significantly larger than the size of the output. This has the effect that all known, generic attacks on the hash function are made much more difficult. Grøstl has good performance on a wide range of platforms and counter-measures against side-channel attacks are well-understood from similar work on the AES.
منابع مشابه
A High-Speed Unified Hardware Architecture for AES and the SHA-3 Candidate Grøstl
The NIST competition for developing the new cryptographic hash standard SHA-3 is currently in the third round. One of the five remaining candidates, Grøstl, is inspired by the Advanced Encryption Standard. This unique feature can be exploited in a large variety of practical applications. In order to have a better picture of the Grøstl-AES computational efficiency (high-level scheduling, interna...
متن کاملGrøstl Addendum
This document is an addendum to the submission document of Grøstl, which was selected for the second round of NIST’s SHA-3 competition [18]. We stress that we do not change the specification of Grøstl. In other words, Grøstl is defined exactly as specified in the original submission document [8]. In this document we mention a few alternative descriptions of our SHA-3 candidate Grøstl and descri...
متن کاملA High-Speed Unified Hardware Architecture for the AES and SHA-3 Candidate Grøstl
The NIST competition for developing the new cryptographic hash algorithm SHA-3 is currently in the third round. One of the five reminding candidates, namely Grøstl, is inspired by the Advanced Encryption Standard. This unique feature can be exploited in a large variety of practical solutions. In order to have a better picture of the Grøstl-AES computational efficiency (high-level scheduling, in...
متن کاملSecurity Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
In 2007, the US National Institute for Standards and Technology announced a call for the design of a new cryptographic hash algorithm in response to the vulnerabilities identified in widely employed hash functions, such as MD5 and SHA-1. NIST received many submissions, 51 of which got accepted to the first round. At present, 5 candidates are left in the third round of the competition. An import...
متن کامل(Chosen-multi-target) preimage attacks on reduced Grøstl-0
The cryptographic hash function Grøstl is a finalist in the NIST’s SHA-3 hash function competition and it is a tweaked variant of its predecessor called Grøstl-0, a second round SHA-3 candidate. In this article, we consider 256-bit Grøstl-0 and its 512-bit compression function. We show that internal differential trails built between the two almost similar looking permutations of the compression...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009